The utility of independent subgoals in theorem proving

Machine-independent Evaluation of Theorem-proving Strategies

The evaluation of theorem-proving strategies has been done traditionally in an empirical manner: a strategy is implemented in a theorem prover, the prover is applied to a number of theorems, and the running times are reported and compared with those of other systems. In recent years, a growing eeort has been devoted to make the evaluation of theorem provers more systematic. The need for a stand...

Prover-independent Axiom Selection for Automated Theorem Proving in Ontohub

In recent years, formalised large theories in form of ontologies, system specifications or mathematical libraries with thousands of sentences have become more and more common. Automatically proving properties in such theories is an important task in research as well as in industry, for instance, as part of system specifications. However, automated theorem provers struggle finding proofs when th...

Theorem Proving for the

This paper discusses the challenges of adding symbolic computation capabilities to a computer algebra system. Indeed, a simple expressions such as m × n can be evaluated to a full value when both m and n have known values. However, if one or both of them have no definite value, then most CASs treat them as symbols and a syntactic representation of some kind is returned. Most CASs do this withou...

Theorem Proving in

Cancellative abelian monoids encompass abelian groups, but also such ubiquitous structures as the natural numbers or multisets. Both the AC axioms and the cancellation law are diicult for a general purpose theorem prover, as they create many variants of clauses which contain sums. We describe a reened superposition calculus for cancellative abelian monoids which requires neither explicit infere...

Theorem Proving in Large